On Exponential - Time Completeness of the Circularity Problem for Attribute
نویسنده
چکیده
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. They reduced the acceptance problems of above automata, which are exponential-time (EXPTIME) complete, to the AG circularity problem. These proofs thus show that the circularity problem is EXPTIME-hard, at least as hard as the most difficult problems in EXPTIME. However, none has shown that the problem is EXPTIME-complete. This paper presents an alternating Turing machine for the circularity problem. The alternating Turing machine requires polynomial space. Thus, the circularity problem is in EXPTIME and is then EXPTIME-complete.
منابع مشابه
A new switching strategy for exponential stabilization of uncertain discrete-time switched linear systems in guaranteed cost control problem
Uncertain switched linear systems are known as an important class of control systems. Performance of these systems is affected by uncertainties and its stabilization is a main concern of recent studies. Existing work on stabilization of these systems only provides asymptotical stabilization via designing switching strategy and state-feedback controller. In this paper, a new switching strate...
متن کاملAn Evolutionary Algorithm Based on a Hybrid Multi-Attribute Decision Making Method for the Multi-Mode Multi-Skilled Resource-constrained Project Scheduling Problem
This paper addresses the multi-mode multi-skilled resource-constrained project scheduling problem. Activities of real world projects often require more than one skill to be accomplished. Besides, in many real-world situations, the resources are multi-skilled workforces. In presence of multi-skilled resources, it is required to determine the combination of workforces assigned to each activity. H...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملTermination Analysis for Higher-Order Attribute Grammars
This paper describes a conservative analysis to detect nontermination in higher-order attribute grammar evaluation caused by the creation of an unbounded number of (finite) trees as local tree-valued attributes, which are then themselves decorated with attributes. This type of non-termination is not detected by a circularity analysis for higherorder attribute grammars. The analysis presented he...
متن کاملSensitivity Analysis of Simple Additive Weighting Method (SAW): The Results of Change in the Weight of One Attribute on the Final Ranking of Alternatives
Most of data in a multi-attribute decision making (MADM) problem are unstable and changeable, then sensitivity analysis after problem solving can effectively contribute to making accurate decisions. This paper provides a new method for sensitivity analysis of MADM problems so that by using it and changing the weights of attributes, one can determine changes in the final results of a decision ma...
متن کامل